Two Schemes to Improve the Performance of a Sort-Last 3D Parallel Rendering Machine with Texture Caches
نویسندگان
چکیده
A sort-last 3D parallel rendering machine distributes the triangles to draw to diierent processors. When building such a machine with each processor having a texture cache, the texture locality is worse and the performance is reduced. This article investigates two schemes to preserve this locality while keeping a good load balancing: triangle slicing and locality aware triangle distribution. With both schemes, the speedups are improved between 2 and 6 times.
منابع مشابه
An Effective Load Balancing Scheme for 3D Texture-Based Sort-Last Parallel Volume Rendering on GPU Clusters
We present an adaptive dynamic load balancing scheme for 3D texture based sort-last parallel volume rendering on a PC cluster equipped with GPUs. Our scheme exploits not only task parallelism but also data parallelism during rendering by combining the hierarchical data structures (octree and parallel BSP tree) in order to skip empty regions and distribute proper workloads to rendering nodes. Ou...
متن کاملAdaptive and Scalable Load Balancing Scheme for Sort-Last Parallel Volume Rendering on GPU Clusters
Sort-last parallel rendering using a cluster of GPUs has been widely used as an efficient method for visualizing large-scale volume datasets. The performance of this method is constrained by load balancing when data parallelism is included. In previous works static partitioning could lead to self-balance when only task level parallelism is included. In this paper, we present a load balancing sc...
متن کاملScalable Rendering on PC Clusters
This paper presents initial results from research targeted at the development of cost-effective scalable visualization and rendering technologies. The implementations of two 3D graphics libraries based on the popular sort-last and sort-first parallel rendering techniques are discussed. An important goal of these implementations is to provide scalable rendering capability for extremely large dat...
متن کاملThe Best Distribution for a Parallel OpenGL 3D Engine with Texture Caches
The quality of a real-time high end virtual reality system depends on its ability to draw millions of textured triangles in 1/60s. The idea of using commodity PC 3D accelerators to build a parallel machine instead of custom ASICs seems more and more attractive as such chips are getting faster. If image parallelism is used, designers have the choice between two distributions: line interleaving a...
متن کاملA Rotate-Tiling Image Compositing Method for Sort-Last Parallel Volume Rendering Systems on Distributed Memory Multicomputers
The binary-swap (BS) and the parallel-pipelined (PP) methods are two well-known image compositing methods for sort-last parallel volume rendering systems. However, these two methods either restrict the number of processors to a power-of-two or require many communication steps to transform image data that results in high data communication overheads. In this paper, we present an efficient image ...
متن کامل